Computational problem - PDFSEARCH.IO - Document Search Engine

Computational problem
Results: 1172

#	Item
961	Backward Induction is PTIME-complete Jakub Szymanik∗ Institute of Logic Language and Computation, University of Amsterdam [removed] Abstract. We prove that the computational problem of finding backward induc Add to Reading List Source URL: jakubszymanik.com Language: English - Date: 2013-07-13 09:14:28 Complexity classes Finite model theory Graph connectivity Game theory FO Reachability P Extensive-form game Tree Theoretical computer science Graph theory Mathematics
962	Assignment Problems R. Burkard, M. Dell’Amico, S. Martello Errata Corrige Page Add to Reading List Source URL: www.assignmentproblems.com Language: English - Date: 2010-09-23 11:54:00 Approximation algorithm Computational complexity theory Mathematical optimization Algorithm Optimization problem Applied mathematics Operations research Mathematics
963	Invitation to Complexity Theory Complexity theory provides new viewpoints on various phenomena that were once considered by past thinkers. By Oded Goldreich DOI: [removed][removed] Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2013-03-27 12:14:10 Probabilistic complexity theory Mathematical optimization Computational complexity theory Structural complexity theory Complexity Average-case complexity P versus NP problem NP-complete Pseudorandom generator Theoretical computer science Applied mathematics Complexity classes
964	How do I simulate problem X? Joan Adler, Yaron Artzi, Liron ben Bashat, Tzipora Yael Izraeli, Meital Kreif, Ido Lavi, Alexander Leibenzon, Adam Levi, Itai Schlesinger, Elad Toledano, Uria Peretz, Yonatan Weisler and Alon Add to Reading List Source URL: phycomp.technion.ac.il Language: English - Date: 2013-11-21 03:53:16 Array programming languages Computational science Scientific modeling MATLAB Numerical linear algebra Mathematica Computational physics Physics Computer simulation Software Mathematical software Science
965	Algorithmica[removed]: 13–36 DOI: [removed]s00453[removed]z Algorithmica © 2007 Springer Science+Business Media, Inc. Add to Reading List Source URL: homepages.cwi.nl Language: English - Date: 2008-01-17 14:27:16 Complexity classes Combinatorial optimization Computational problems NP-complete problems Optimization problem NP Time complexity Cut Reduction Theoretical computer science Computational complexity theory Applied mathematics
966	Chapter 6 Quantum Computation 6.1 Classical Circuits Add to Reading List Source URL: www.theory.caltech.edu Language: English - Date: 2009-07-16 20:16:32 Complexity classes Mathematical optimization Models of computation Quantum information science P versus NP problem NP P Quantum circuit Quantum computer Theoretical computer science Computational complexity theory Applied mathematics
967	. COPIES ARE AVAILABLE IN THE MATH LIBRARY PROBLEM OF THE WEEK[removed] Add to Reading List Source URL: www.math.purdue.edu Language: English - Date: 2014-03-03 08:40:00 Computational problems Mathematics Operations research Mathematical optimization
968	Victor Shoup Curriculum Vitae Feb. 6, 2014 Department of Computer Science Courant Institute of Mathematical Sciences New York University 251 Mercer Street Add to Reading List Source URL: www.shoup.net Language: English - Date: 2014-02-06 21:21:47 Finite fields Cryptographic protocols Homomorphic encryption Diffie–Hellman problem Strong RSA assumption RSA Elliptic curve cryptography Actor model Eurocrypt Cryptography Public-key cryptography Computational hardness assumptions
969	c Pleiades Publishing, Ltd., 2009. ISSN[removed], Journal of Applied and Industrial Mathematics, 2009, Vol. 3, No. 4, pp. 419–432. c V.L. Beresnev, 2008, published in Diskretnyi Analiz i Issledovanie Operatsii, 2008 Add to Reading List Source URL: www.math.nsc.ru Language: English - Date: 2011-12-28 03:37:04 Theoretical computer science Mathematical optimization Computational problems Convex optimization Linear programming Shortest path problem Dynamic programming IJ Optimization problem Operations research Mathematics Applied mathematics
970	Lecture Notes for Ph219/CS219: Quantum Information and Computation Chapter 5 John Preskill California Institute of Technology November, 2013 Add to Reading List Source URL: www.theory.caltech.edu Language: English - Date: 2013-11-14 21:06:14 Complexity classes Quantum information science Mathematical optimization Models of computation P versus NP problem Boolean circuit Circuit complexity P Quantum circuit Theoretical computer science Applied mathematics Computational complexity theory

UPDATE